NN-LM (Khandelwal et al., 2020) modify the LM output with a non-parametric Work done during internship at Meta. 38th Conference on Neural Information Processing Systems (NeurIPS 2024).

Evaluating the factuality of long-form generations from Large Language Models (LLMs) remains challenging due to efficiency bottlenecks and reliability concerns. Prior efforts attempt this by decomposing text into claims, searching for evidence, and verifying claims, but suffer from critical drawbacks: (1) inefficiency due to overcomplicated pipeline components, and (2) ineffectiveness stemming from inaccurate claim sets and insufficient evidence. To address these limitations, we propose \textbf{FaStfact}, an evaluation framework that achieves the highest alignment with human evaluation and time/token efficiency among existing baselines. FaStfact first employs chunk-level claim extraction integrated with confidence-based pre-verification, significantly reducing the time and token cost while ensuring reliability. For searching and verification, it collects document-level evidence from crawled web-pages and selectively retrieves it during verification. Extensive experiments based on an annotated benchmark \textbf{FaStfact-Bench} demonstrate the reliability of FaStfact in both efficiently and effectively evaluating long-form factuality. Code, benchmark data, and annotation interface tool are available at https://github.com/Yingjia-Wan/FaStfact.

NN-LM (Khandelwal et al., 2020) modify the LM output with a non-parametric Work done during internship at Meta. 38th Conference on Neural Information Processing Systems (NeurIPS 2024).

Transcription Factor Binding Site (TFBS) prediction is crucial for understanding gene regulation and various biological processes. This study introduces a novel Mixture of Experts (MoE) approach for TFBS prediction, integrating multiple pre-trained Convolutional Neural Network (CNN) models, each specializing in different TFBS patterns. We evaluate the performance of our MoE model against individual expert models on both in-distribution and out-of-distribution (OOD) datasets, using six randomly selected transcription factors (TFs) for OOD testing. Our results demonstrate that the MoE model achieves competitive or superior performance across diverse TF binding sites, particularly excelling in OOD scenarios. The Analysis of Variance (ANOVA) statistical test confirms the significance of these performance differences. Additionally, we introduce ShiftSmooth, a novel attribution mapping technique that provides more robust model interpretability by considering small shifts in input sequences. Through comprehensive explainability analysis, we show that ShiftSmooth offers superior attribution for motif discovery and localization compared to traditional Vanilla Gradient methods. Our work presents an efficient, generalizable, and interpretable solution for TFBS prediction, potentially enabling new discoveries in genome biology and advancing our understanding of transcriptional regulation.

Recent advancements in Large Language Models (LLMs) have significantly enhanced the ability to develop systems that comprehend customer requests and determine the necessary actions to fulfill them. In today's competitive market, delivering superior custome r service is crucial for attracting and retaining clients. Satisfied customers are more likely to become loyal, repeat buyers, and advocate for your brand, leading to increased revenue and market share (Strikingly, 2024) . In industries characterized by intense competition, implementing LLM - based services that effectively address customer needs and enhance satisfaction is becoming a key determinant of a company's growth and success. By leveraging LLMs, businesses can deliver more personalized, efficient, and scalable support, and thereby improve customer experience and foster loyalty (Iopex, 2024) .

We study empirical Bayes estimation in high-dimensional linear regression. To facilitate computationally efficient estimation of the underlying prior, we adopt a variational empirical Bayes approach, introduced originally in Carbonetto and Stephens (2012) and Kim et al. (2022). We establish asymptotic consistency of the nonparametric maximum likelihood estimator (NPMLE) and its (computable) naive mean field variational surrogate under mild assumptions on the design and the prior. Assuming, in addition, that the naive mean field approximation has a dominant optimizer, we develop a computationally efficient approximation to the oracle posterior distribution, and establish its accuracy under the 1-Wasserstein metric. This enables computationally feasible Bayesian inference; e.g., construction of posterior credible intervals with an average coverage guarantee, Bayes optimal estimation for the regression coefficients, estimation of the proportion of non-nulls, etc. Our analysis covers both deterministic and random designs, and accommodates correlations among the features. To the best of our knowledge, this provides the first rigorous nonparametric empirical Bayes method in a high-dimensional regression setting without sparsity.

The deep linear network (DLN) is a model for implicit regularization in gradient based optimization of overparametrized learning architectures. Training the DLN corresponds to a Riemannian gradient flow, where the Riemannian metric is defined by the architecture of the network and the loss function is defined by the learning task. We extend this geometric framework, obtaining explicit expressions for the volume form, including the case when the network has infinite depth. We investigate the link between the Riemannian geometry and the training asymptotics for matrix completion with rigorous analysis and numerics. We propose that under small initialization, implicit regularization is a result of bias towards high state space volume.

All qualified applicants will receive due consideration for employment without any discrimination. All applicants will be evaluated solely on the basis of their ability, competence and their proven capability to perform the functions outlined in the corresponding role. We promote and support a diverse workforce across all levels in the company.

While most executives at financial institutions agree that artificial intelligence (AI) is important to their organization's success, few have fully implemented AI projects. In a recent Cognizant survey of 230 financial services executives, three-quarters said AI is extremely or very important to the success of their organizations. However, only 61% of those were aware of an AI project at their company. Even more telling, only 29% were aware of a project that had been fully implemented. Clearly, AI is quickly becoming a competitive requirement, creating the risk that those who are not implementing or updating AI capabilities will fall behind.

Cognizant is looking for an Advanced Analytics Lead. If you meet our background requirements and skills, and looking for an opportunity to be rewarded for your skills and expertise, is the ideal opportunity for you! If you require accessibility assistance applying for open positions in the US please send an email with your request to CareersNorthAmerica@cognizant.com Qualifications Technical Skills PL1 The associate has basic awareness and comprehension of the skill and is in the process of acquiring this skill through various channels. PL2 The associate possesses working knowledge of the skill, and can actively and independently apply this skill in engagements and projects. PL3 The associate has comprehensive, in-depth and specialized knowledge of the skill.